Meshless parameterization and surface reconstruction
نویسندگان
چکیده
This paper proposes a method called meshless parameterization for param eterizing and triangulating single patch unorganized point sets The points are mapped into a planar parameter domain by solving a sparse linear system By making a stan dard triangulation of the parameter points we obtain a corresponding triangulation of the original data set
منابع مشابه
A Genetic Approach to Detect Boundaries for Meshless Parameterization and Surface Reconstruction
In this paper we present a boundary detection algorithm for unorganized point sets and apply it for surface reconstruction using the meshless parameterization method from M. S. Floater and M. Reimers, Meshless parameterization and surface reconstruction, Comp. Aided Geom. Design, 18:77-92, 2001. The algorithm consists of two steps. Under mild assumptions, we can prove that the first step of our...
متن کاملMesh reconstruction by meshless denoising and parameterization
We present a new approach to simultaneously denoise and parameterize unorganized point cloud data. This is achieved by minimizing an appropriate energy function defined on the point cloud and its parameterization. An iterative algorithm to minimize the energy is described. The key ingredient of our approach is an “as-rigid-as-possible” meshless parameterization to map a point cloud with disk to...
متن کاملMeshless Parameterization and B-Spline Surface Approximation
This paper proposes a method for approximating unorganized points in lR 3 with smooth B-spline surfaces. The method involves: meshless parameteri-zation; triangulation; shape-preserving reparameterization; and least squares spline approximation.
متن کاملReconstruction and smoothing of polygonal curves
In this paper we propose a method for piecewise linear reconstruction and subsequent smoothing of a point sampled curve. The reconstruction step is based on the meshless parameterization reconstruction algorithm proposed by Floater. The information computed in the reconstruction step is used for a least squares based discrete smoothing method, with behavior comparable to a smoothing spline. We ...
متن کاملMeshless surface reconstruction by kernel clustering
We discuss a meshless approach to the problem of reconstructing a surface in from a finite sampling. This approach is a direct adaptation of a kernel method for clustering points in Euclidean space. The reconstructed surface is the preimage of the boundary of the smallest enclosing ball of the sample points mapped into some feature space. We have implemented this approach and report on our expe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 18 شماره
صفحات -
تاریخ انتشار 2001